Lagrangian, Eulerian and Kantorovich formulations of multi-agent optimal control problems: Equivalence and Gamma-convergence

نویسندگان

چکیده

This paper is devoted to the study of multi-agent deterministic optimal control problems. We initially provide a thorough analysis Lagrangian, Eulerian and Kantorovich formulations problems, as well their relaxations. Then we exhibit some equivalence results among various representations compare respective value functions. To do it, combine techniques ideas from transportation, theory, Young measures evolution equations in Banach spaces. further exploit connections Lagrangian descriptions derive consistency number particles/agents tends infinity. that purpose prove an empirical version Superposition Principle obtain suitable Gamma-convergence for controlled systems.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Uniform Convergence Rates for Eulerian and Lagrangian Nite Element Approximations of Convection-dominated Diiusion Problems

Standard error estimates for nite element approximations of nonstationary convection-diiusion problems depend reciprocally on the diffusion parameter ". Therefore, the estimates become worthless in the case of strong convection-dominance 0 < " 1. This work provides an "-uniform convergence theory for nite element discretizations of convection-dominated diiusion problems in Eulerian and Lagrangi...

متن کامل

Equivalence of multitime optimal control problems

Many science and engineering problems can be formulated as optimization problems that are governed by m-flow type PDEs (multitime evolution systems) and by cost functionals expressed as curvilinear integrals or multiple integrals. Though these functionals are mathematically equivalent on m-intervals, their meaning is totally different in real life problems. Our paper discusses the m-flow type P...

متن کامل

Optimal Convergence in Multi-Agent MDPs

Learning Automata (LA) were recently shown to be valuable tools for designing Multi-Agent Reinforcement Learning algorithms. One of the principal contributions of LA theory is that a set of decentralized, independent learning automata is able to control a finite Markov Chain with unknown transition probabilities and rewards. We extend this result to the framework of Multi-Agent MDP’s, a straigh...

متن کامل

On Lagrangian Dynamics and Its Control Formulations

Abstract This paper exploits the equivalence between constrained dynamics problems and a class of tracking control problems. An alternative derivation of the modern formulation of Parczewski and Blajer (1989) is presented, including some new analysis on the “almost singular” case, followed by a critique of the classical Lagrangian formulation. In addition, a new formulation which allows the con...

متن کامل

Approximate Pareto Optimal Solutions of Multi objective Optimal Control Problems by Evolutionary Algorithms

In this paper an approach based on evolutionary algorithms to find Pareto optimal pair of state and control for multi-objective optimal control problems (MOOCP)'s is introduced‎. ‎In this approach‎, ‎first a discretized form of the time-control space is considered and then‎, ‎a piecewise linear control and a piecewise linear trajectory are obtained from the discretized time-control space using ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Differential Equations

سال: 2022

ISSN: ['1090-2732', '0022-0396']

DOI: https://doi.org/10.1016/j.jde.2022.03.019